Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Object tracking algorithm based on static-adaptive appearance model correction
WEI Baoguo, GE Ping, WU Hong, WANG Gaofeng, HAN Wenliang
Journal of Computer Applications    2018, 38 (4): 1170-1175.   DOI: 10.11772/j.issn.1001-9081.2017092312
Abstract517)      PDF (1086KB)(432)       Save
For long-term robust tracking to single target, a corrected tracking algorithm based on static-adaptive appearance model was proposed. Firstly, the interference factors that may be encountered in the tracking process were divided into two categories from environment and target itself, then a static appearance model and an adaptive appearance model were proposed respectively. The static appearance model was used for global matching while the adaptive appearance model was employed for local tracking, and the former corrected tracking drift of the latter. A single-link hierarchical clustering algorithm was used to remove the noise introduced by the fusion of the above two models. To capture the re-occurring target, static appearance model was applied for global search. Experimental results on standard video sequences show that the accuracy of tracking the target center is 0.9, and the computer can process 26 frames per second. The proposed tracking algorithm framework can achieve long-term stable tracking with good robustness and real-time performance.
Reference | Related Articles | Metrics
Digital signature based on factoring polynomials over a large infinite field
CUI Guo-hua,GE Ping
Journal of Computer Applications    2005, 25 (04): 842-843.   DOI: 10.3724/SP.J.1087.2005.0842
Abstract1207)      PDF (86KB)(895)       Save

Some of representative digital signature scheme, such as RSA, make the use of large number and therefore the efficiency is not favorable, especially in the situation that the digital signatures are necessary to be commuted constantly. Rabin system is comparative simple, but it has to pick some special large prime to utilization. The paper provided a new digital signature scheme according to the characteristics of factoring polynomials over a large infinite field and quadratic residue. The scheme is not only as secure and effective as Rabin scheme,but also has not particular demand of the basic prime.

Related Articles | Metrics